Trees that Grow
نویسندگان
چکیده
We study the notion of extensibility in functional data types, as a new approach to the problem of decorating abstract syntax trees with additional information. We observed the need for such extensibility while redesigning the data types representing Haskell abstract syntax inside Glasgow Haskell Compiler (GHC). Specifically, we describe a programming idiom that exploits type-level functions to allow a particular form of extensibility. The approach scales to support existentials and generalised algebraic data types, and we can use pattern synonyms to make it convenient in practice.
منابع مشابه
Evaluation of the morphological Characteristics of broadleaf and needle leaf old trees for Use in Reforestation of forests in Ilam Province
Old trees as the most important genetic reserves of the country have great importance and value in various aspects of ecology, forest restoration management, ecotourism and even history. In this research, after identification of the old trees in the forests of Ilam province, their morphological characteristics including DBH, trunk height, total height, crown length, min & max crown diameter, cr...
متن کاملGrowing Binary Trees in a Random Environment
We study a class of binary trees that grow in a random environment, where the state of the environment can change at every vertex of the trees. The trees considered are single-type and two-type binary trees that grow in a two-state Markovian environment. For each kind of tree, the conditions on the environment process for extinction of the tree are determined, and the problem of calculating the...
متن کاملRamped Half-n-Half Initialisation Bias in GP
Tree initialisation techniques for genetic programming (GP) are examined in [4,3], highlighting a bias in the standard implementation of the initialisation method Ramped Half-n-Half (RHH) [1]. GP trees typically evolve to random shapes, even when populations were initially full or minimal trees [2]. In canonical GP, unbalanced and sparse trees increase the probability that bigger subtrees are s...
متن کاملAn asymmetric entropy measure for decision trees
In this paper we present a new entropy measure to grow decision trees. This measure has the characteristic to be asymmetric, allowing the user to grow trees which better correspond to his expectation in terms of recall and precision on each class. Then we propose decision rules adapted to such trees. Experiments have been realized on real medical data from breast cancer screening units.
متن کاملOn the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels
A class of binary trees that grow in a random environment,where the state of the environment can change at every vertex of thetrees is studied. The trees considered are single-type and two-type binarytrees that grow in a two-state Markovian environment.For each kind oftree, the conditions on the environment process for extinction of the treeare determined, and the proble...
متن کاملDynamic Evolution of Congestion Trees: Analysis and Impact on Switch Architecture
Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to reduce them consists of reducing the number of network components and increasing their utilization. However, doing so without a suitable congestion management mechanism may lead to dramatic throughput degradation when the netw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 23 شماره
صفحات -
تاریخ انتشار 2017